29 research outputs found

    Dictionary Learning-Based Speech Enhancement

    Get PDF

    Co-treatment of organic fractions of urban waste for energy recovery: a case study from Hanoi city, Vietnam

    Get PDF
    The authors have quantified material and energy flows in two options of co-treatment of organic fractions of wastes by composting, and by anaerobic digestion. The results shown thermophilic anaerobic co-digestion of septic tank sludge, sewage sludge and organic municipal solid waste has provided the biogas yield of 19.6 m3 per ton of mixed waste, equal to 114 kWh of heat and power. The calculation for the case of Long Bien district, Hanoi city has shown anaerobic co-digestion of waste fractions could generate 111,220 kWh of heat and power per day, helping the waste treatment complex to be selfsufficient in terms of energy. Besides, 32.2 MWh/day of surplus energy could be sold to the grid. This option also reduced emission of greenhouse gases versus composting. The study can be used as basis for cost-benefit analyses in selection of appropriate urban waste management options aiming at efficient utilization of engineering infrastructure systems, waste treatment and resource recovery

    A solution for synchronous incremental maintenance of materialized views based on SQL recursive query

    Get PDF
    Materialized views are excessively stored query execution results in the database. They can be used to partially or completely answer queries which will be further appeared instead of re-executing query from the scratch. There is a large number of published works that address the maintenance, especially incremental update, of materialized views and query rewriting for using those ones. Some of them support materialized views based on recursive query in datalog language. Although most of datalog queries can be transferred into SQL queries and vise versa but it is not the case for recursive queries. Recursive queries in the data log try to find all possible transitive closures. Recursive queries in SQL (Common Table Expression – CTE) return direct links but not transitive closures. In this paper, we propose efficient methods for incremental update of materialized views based on CTE; and then propose an algorithm for generating source codes in C language for any input SQL recursive queries. The synthesized source codes implement our proposed incremental update algorithms according to inserted/deleted/updated record set in the base tables. This paper focuses mainly on the recursive queries whose execution results are directed tree-structured data. The two cases of tree node are considered. In the first case, a child node has only one parent node and in the second case, a child node can have many parent nodes. Those two cases represent the two types of relationships between entities in real world, that are one–to–many and many–to–many, respectively. For the one–to–many relationships, the relationship data is accompanied with the records describing the child using some fields. Those fields are set as null in deleting a concrete relationship. For the many–to–many relationships, it is stored in a separate table and the concrete relationships are removed by deleting describing records from that table. Considering of enforcing referential integrity may help to reduce the searching space and therefore, help to improve the performance. However, the set of tree nodes or tree edges can be manipulated. All those combinations lead to different algorithms. The experimental results are provided and discussed to confirm the effectiveness of our proposed method

    A solution for synchronous incremental maintenance of materialized views based on SQL recursive query

    Get PDF
    Materialized views are excessively stored query execution results in the database. They can be used to partially or completely answer queries which will be further appeared instead of re-executing query from the scratch. There is a large number of published works that address the maintenance, especially incremental update, of materialized views and query rewriting for using those ones. Some of them support materialized views based on recursive query in datalog language. Although most of datalog queries can be transferred into SQL queries and vise versa but it is not the case for recursive queries. Recursive queries in the data log try to find all possible transitive closures. Recursive queries in SQL (Common Table Expression – CTE) return direct links but not transitive closures. In this paper, we propose efficient methods for incremental update of materialized views based on CTE; and then propose an algorithm for generating source codes in C language for any input SQL recursive queries. The synthesized source codes implement our proposed incremental update algorithms according to inserted/deleted/updated record set in the base tables. This paper focuses mainly on the recursive queries whose execution results are directed tree-structured data. The two cases of tree node are considered. In the first case, a child node has only one parent node and in the second case, a child node can have many parent nodes. Those two cases represent the two types of relationships between entities in real world, that are one–to–many and many–to–many, respectively. For the one–to–many relationships, the relationship data is accompanied with the records describing the child using some fields. Those fields are set as null in deleting a concrete relationship. For the many–to–many relationships, it is stored in a separate table and the concrete relationships are removed by deleting describing records from that table. Considering of enforcing referential integrity may help to reduce the searching space and therefore, help to improve the performance. However, the set of tree nodes or tree edges can be manipulated. All those combinations lead to different algorithms. The experimental results are provided and discussed to confirm the effectiveness of our proposed method

    Microscopic Observation Drug Susceptibility Assay (MODS) for Early Diagnosis of Tuberculosis in Children

    Get PDF
    MODS is a novel liquid culture based technique that has been shown to be effective and rapid for early diagnosis of tuberculosis (TB). We evaluated the MODS assay for diagnosis of TB in children in Viet Nam. 217 consecutive samples including sputum (n = 132), gastric fluid (n = 50), CSF (n = 32) and pleural fluid (n = 3) collected from 96 children with suspected TB, were tested by smear, MODS and MGIT. When test results were aggregated by patient, the sensitivity and specificity of smear, MGIT and MODS against “clinical diagnosis” (confirmed and probable groups) as the gold standard were 28.2% and 100%, 42.3% and 100%, 39.7% and 94.4%, respectively. The sensitivity of MGIT and MODS was not significantly different in this analysis (P = 0.5), but MGIT was more sensitive than MODS when analysed on the sample level using a marginal model (P = 0.03). The median time to detection of MODS and MGIT were 8 days and 13 days, respectively, and the time to detection was significantly shorter for MODS in samples where both tests were positive (P<0.001). An analysis of time-dependent sensitivity showed that the detection rates were significantly higher for MODS than for MGIT by day 7 or day 14 (P<0.001 and P = 0.04), respectively. MODS is a rapid and sensitive alternative method for the isolation of M.tuberculosis from children

    Effect of solid retention time (SRT) on protein hydrolysis and acidogenesis at pH 5 and pH 7 using gelatine as a model protein

    No full text
    Anaerobic conversion can be used to recover volatile fatty acids (VFA) from high-strength wastewaters and organic wastes. However, many waste(waters) contain considerable concentrations of proteins and knowledge about anaerobic conversion of protein into VFAs is limited. In this study the effect of the solids retention time (SRT) and pH on dissolved protein conversion into VFAs was investigated in completely stirred tank reactors operated at 35 °C. At pH 5 and with an SRT of 12 and 30 days, hydrolysis was the rate-limiting step of protein degradation. At pH 7 and at SRT ≤ 8 days, the system shifted from being limited by hydrolysis to being limited by the conversion of amino acids to VFA. Even after a long-term exposure of the biomass to pH 5 (480 days), the hydrolysis rate constant for protein (0.05 L g−1VSS day−1) was still much lower than at pH 7 (0.62 L g−1VSS day−1). The difference between pH 5 and pH 7 is explained by the inhibitory effect of the large fraction of undissociated VFA at pH 5, which was confirmed in batch experiments. The highest volumetric VFA productivity of 2.3 g COD L−1 day−1 was obtained at pH 7 and at an SRT of 10 days. For complete removal of protein a longer SRT is required

    Protein hydrolysis and fermentation under methanogenic and acidifying conditions

    No full text
    Background: Many kinds of wastewaters contain appreciable quantities of protein. Anaerobic processes are suitable for the treatment of wastewater high in organics to achieve pollution control and recovery of energy as methane and hydrogen, or intermediates for production of biofuels and valuable biochemicals. A distinction between protein hydrolysis and amino acid fermentation, especially for dissolved proteins, is needed to target which one is truly rate-limiting and to effectively harvest bioproducts during anaerobic conversion of these wastewaters. This study explored mesophilic anaerobic hydrolysis and amino acid fermentation of gelatine, as a model for dissolved proteins, at pH 7 and at pH 5. Results: The results showed that at pH 7, protein hydrolysis (first-order rate of 0.15 h-1) was approximately 5 times faster than acidification of the hydrolysis products (first-order rate of 0.03 h-1), implying that not hydrolysis but acidification was the rate-limiting step in anaerobic dissolved protein degradation. This was confirmed by (temporary) accumulation of amino acids. Nineteen different amino acids were detected during the first 8 incubation hours of gelatine at neutral pH and the total chemical oxygen demand (COD) of these 19 amino acids was up to approximately 40% of the COD of the gelatine that was added. Protein hydrolysis at pH 5 was 2-25 times slower than at pH 7. Shifting the initial pH from neutral to acidic conditions (pH 5) inhibited protein degradation and changed the volatile fatty acids (VFA) product profile. Furthermore, the presence or absence of methanogenic activity did not affect the rates of protein hydrolysis and acidification. Conclusions: The findings in this study can help to set a suitable solid retention time to accomplish anaerobic degradation of protein-rich wastewaters in continuous reactor systems. For example, if the target is harvesting VFAs, methanogens can be washed-out for a shorter retention time while amino acid fermentation, instead of hydrolysis as assumed previously, will govern the design and solutions to improve the system dealing with dissolved proteins.[Figure not available: see fulltext].</p

    Effect of carbohydrates on protein hydrolysis in anaerobic digestion

    No full text
    This study aimed to assess the effect of carbohydrates on protein hydrolysis and potential implications for the design of anaerobic reactors for treatment of protein-rich wastewaters. Batch experiments were carried out with dissolved starch (Sta) and gelatine (Gel) at different chemical oxygen demand (COD) ratios ranging from 0 to 5.5 under methanogenic conditions for methane production and up to 3.8 under non-methanogenic conditions for volatile fatty acids (VFA), both at 35 °C. The Sta/Gel did not have a direct effect on the gelatine hydrolysis rate constants under methanogenic (0.51 ± 0.05 L g VSS-1 day-1) and non-methanogenic conditions (0.48 ± 0.05 L g VSS-1 day-1). However, under non-methanogenic conditions, gelatine hydrolysis was inhibited by 64% when a spectrum of VFA was added at a VFA/Gel (COD) ratio of 5.9. This was not caused by the ionic strength exerted by VFA but by the VFA itself. These results imply that methanogenesis dictates the reactor design for methane production but hydrolysis does for VFA production from wastewater protein

    Maximum Volume Constrained Graph Nonnegative Matrix Factorization for Facial Expression Recognition

    No full text
    corecore